Using Query Expansion in Manifold Ranking for Query-Oriented Multi-document Summarization

نویسندگان

چکیده

Manifold ranking has been successfully applied in query-oriented multi-document summarization. It not only makes use of the relationships among sentences, but also between given query and sentences. However, information original is often insufficient. So we present a expansion method, which combined manifold to resolve this problem. Our method utilizes term itself knowledge base WordNet expand it by synonyms, uses document set various ways (mean expansion, variance TextRank expansion). Compared with previous methods, our combines multiple methods better represent information, at same time, useful attempt on ranking. In addition, degree word overlap proximity words calculate similarity We performed experiments datasets DUC 2006 DUC2007, evaluation results show that proposed can significantly improve system performance make comparable state-of-the-art systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Query Architecture Expansion in Web Using Fuzzy Multi Domain Ontology

Due to the increasing web, there are many challenges to establish a general framework for data mining and retrieving structured data from the Web. Creating an ontology is a step towards solving this problem. The ontology raises the main entity and the concept of any data in data mining. In this paper, we tried to propose a method for applying the "meaning" of the search system, But the problem ...

متن کامل

Query-Oriented Multi-Document Summarization via Unsupervised Deep Learning

Extractive style query oriented multi document summariza tion generates the summary by extracting a proper set of sentences from multiple documents based on the pre given query. This paper proposes a novel multi document summa rization framework via deep learning model. This uniform framework consists of three parts: concepts extraction, summary generation, and reconstruction validation, which ...

متن کامل

RelationListwise for Query-Focused Multi-Document Summarization

Most existing learning to rank based summarization methods only used content relevance of sentences with respect to queries to rank or estimate sentences, while neglecting sentence relationships. In our work, we propose a novel model, RelationListwise, by integrating relation information among all the estimated sentences into listMLE-Top K, a basic listwise learning to rank model, to improve th...

متن کامل

CLASSY Query-Based Multi-Document Summarization

Our summarizer is based on an HMM (Hidden Markov Model) for sentence selection within a document and a pivoted QR algorithm to generate a multi-document summary. Each year, since we began participating in DUC in 2001, we have modified the features used by the HMM and have added linguistic capabilities in order to improve the summaries we generate. Our system, called “CLASSY” (Clustering, Lingui...

متن کامل

A Query Focused Multi Document Automatic Summarization

The present paper describes the development of a query focused multi-document automatic summarization. A graph is constructed, where the nodes are sentences of the documents and edge scores reflect the correlation measure between the nodes. The system clusters similar texts having related topical features from the graph using edge scores. Next, query dependent weights for each sentence are adde...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2021

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-030-84186-7_7